Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

a1(b1(a1(b1(x)))) -> b1(a1(b1(a1(a1(b1(x))))))

Q is empty.


QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

a1(b1(a1(b1(x)))) -> b1(a1(b1(a1(a1(b1(x))))))

Q is empty.

Q DP problem:
The TRS P consists of the following rules:

A1(b1(a1(b1(x)))) -> A1(a1(b1(x)))
A1(b1(a1(b1(x)))) -> A1(b1(a1(a1(b1(x)))))

The TRS R consists of the following rules:

a1(b1(a1(b1(x)))) -> b1(a1(b1(a1(a1(b1(x))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
QDP

Q DP problem:
The TRS P consists of the following rules:

A1(b1(a1(b1(x)))) -> A1(a1(b1(x)))
A1(b1(a1(b1(x)))) -> A1(b1(a1(a1(b1(x)))))

The TRS R consists of the following rules:

a1(b1(a1(b1(x)))) -> b1(a1(b1(a1(a1(b1(x))))))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.